Search results for "Integer linear programming formulation"
showing 2 items of 2 documents
Determining the best shipper sizes for sending products to customers
2014
A distribution company has to send products, packed into shippers, from the warehouse to retail shops. The number of different shipper types is regarded as a parameter given by the user, who is looking for a balance between transportation costs and stock and procurement costs. The problem is to decide the sizes of the shipper types to keep at the warehouse so as to minimize the cost of meeting the forecasted demand over the planning horizon. In this paper, we describe an integer linear programming formulation for the problem and obtaining feasible solutions. Other models, based on multiknapsack and p-median and facility location models, are for obtaining lower bounds. We study several ways …
A Column Generation Approach to Scheduling of Periodic Tasks
2011
We present an algorithm based on column generation for a real time scheduling problem, in which all tasks appear regularly after a given period. Furthermore, the tasks exchange messages, which have to be transferred over a bus, if the tasks involved are executed on different ECUs. Experiments show that for large instances our preliminary implementation is faster than the previous approach based on an integer linear programming formulation using a state-of-the-art solver.